منابع مشابه
Resizable, Scalable, Concurrent Hash Tables
We present algorithms for shrinking and expanding a hash table while allowing concurrent, wait-free, linearly scalable lookups. These resize algorithms allow the hash table to maintain constant-time performance as the number of entries grows, and reclaim memory as the number of entries decreases, without delaying or disrupting readers. We implemented our algorithms in the Linux kernel, to test ...
متن کاملEnhancing KiWi - Scalable Concurrent Key-Value Map
We take a relatively fresh wait-free, concurrent sorted map called KiWi, fix and enhance it. First, we test its linearizability by fuzzing and applying Wing&Gong [2] linearizability test. After fixing a few bugs in the algorithm design and its implementation, we enhance it. We design, implement and test tw...
متن کاملEfficient Learning of Ensembles with QuadBoost
We first present a general risk bound for ensembles that depends on the Lp norm of the weighted combination of voters which can be selected from a continuous set. We then propose a boosting method, called QuadBoost, which is strongly supported by the general risk bound and has very simple rules for assigning the voters’ weights. Moreover, QuadBoost exhibits a rate of decrease of its empirical e...
متن کاملSystematic and Scalable Testing of Concurrent Programs
The challenge this thesis addresses is to speed up the development of concurrent programs by increasing the efficiency with which concurrent programs can be tested and consequently evolved. The goal of this thesis is to generate methods and tools that help software engineers increase confidence in the correct operation of their programs. To achieve this goal, this thesis advocates testing of co...
متن کاملTowards Provably Scalable Concurrent Search Algorithms
This report contains complementary definitions on sequential proximity [2]. Furthermore, in this report we motivate sequential proximity by using it to prove that two concurrent search data structures are sequentially proximal and show how sequentially proximity can help a developer create a highly-scalable linked list. In Section 2 we present related work. In Section 3 we give precise definiti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2018
ISSN: 1045-9219,1558-2183,2161-9883
DOI: 10.1109/tpds.2017.2762298